Prevalence and Recoverability of Syntactic Parameters in Sparse Distributed Memories
نویسندگان
چکیده
We propose a new method, based on Sparse Distributed Memory (Kanerva Networks), for studying dependency relations between different syntactic parameters in the Principles and Parameters model of Syntax. We store data of syntactic parameters of world languages in a Kanerva Network and we check the recoverability of corrupted parameter data from the network. We find that different syntactic parameters have different degrees of recoverability. We identify two different effects: an overall underlying relation between the prevalence of parameters across languages and their degree of recoverability, and a finer effect that makes some parameters more easily recoverable beyond what their prevalence would indicate. We interpret a higher recoverability for a syntactic parameter as an indication of the existence of a dependency relation, through which the given parameter can be determined using the remaining uncorrupted data.
منابع مشابه
Robot navigation based on view sequences stored in a sparse distributed memory
Robot navigation is a large area of research, where many different approaches have already been tried, including navigation based on visual memories. The Sparse Distributed Memory (SDM) is a kind of associative memory based on the properties of high-dimensional binary spaces. It exhibits characteristics, such as tolerance to noise and incomplete data, ability to work with sequences and the poss...
متن کاملA Recoverable Distributed Shared Memory Integrating Coherence and Recoverability
Large-scale distributed systems are very attractive for the execution of parallel applications requiring a huge computing power. However, their high probability of site failure is unacceptable, especially for long time running applications. In this paper, we address this problem and propose a checkpointing mechanism relying on a recoverable distributed shared memory (DSM). Although most recover...
متن کاملRecoverability Analysis for Modified Compressive Sensing with Partially Known Support
The recently proposed modified-compressive sensing (modified-CS), which utilizes the partially known support as prior knowledge, significantly improves the performance of recovering sparse signals. However, modified-CS depends heavily on the reliability of the known support. An important problem, which must be studied further, is the recoverability of modified-CS when the known support contains...
متن کاملExploiting the analogy between immunology and sparse distributed memories: a system for lustering non-stationary data
متن کامل
Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized x-ray CT
We study recoverability in fan-beam computed tomography (CT) with sparsity and total variation priors: how many underdetermined linear measurements suffice for recovering images of given sparsity? Results from compressed sensing (CS) establish such conditions for, e.g., random measurements, but not for CT. Recoverability is typically tested by checking whether a computed solution recovers the o...
متن کامل